The star trellis decoding of Reed-Solomon codes

نویسنده

  • Sergei V. Fedorenko
چکیده

For the Golay code GGolay with codelength n = 24 the star trellis was proposed in [1]. The time axis consists of a number of parts I = ∪jIj , which are joint in one common point. In Figure 1 an example factor graph representation is depicted. This example has three equal length parts. The time axis of the parts are given by Ij = {0, (j − 1)n/3 + 1, . . . , jn/3,∞}, where ∞ denotes the junction. This junction in Figure 1 is represented by a square and the state space is denoted Si. Each part of the time axis is associated with the conventional trellis shortening with a single starting state and some end states. The star trellis consists of a union of all conventional trellis shortening in the junction ∞. The star trellis of the Golay code is given in Figure 2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Stage Trellis Decoding of RS Codes Based on the Shannon Product

In this paper we present a tech nique for low complexity decoding of Reed Solomon RS codes We describe a method for which the implementation complexity has been estimated when compared to standard Viterbi decoding over the minimal trellis Finally we present some computer simulation results for decoding the RS code

متن کامل

New multilevel codes over GF(q)

In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...

متن کامل

Low-complexity trellis decoding of linear block codes - Communications, IEE Proceedings-

The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed. They also introduce a novel trellis design procedure for the proposed codes. It is shown that the trellises of the designed codes are similar to...

متن کامل

Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes

In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...

متن کامل

Tail-Biting Trellises of Block Codes: Trellis Complexity and Viterbi Decoding Complexity

Tail-biting trellises of linear and nonlinear block codes are addressed. We refine the information-theoretic approach of a previous work on conventional trellis representation, and show that the same ideas carry over to tail-biting trellises. We present lower bounds on the state and branch complexity profiles of these representations. These bounds are expressed in terms of mutual information be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0707.1025  شماره 

صفحات  -

تاریخ انتشار 2007